Embedding of cycles and wheels into arbitrary trees
نویسندگان
چکیده
We estimate and characterize the edge congestion-sum measure for embeddings of various graphs such as cycles, wheels, and generalized wheels into arbitrary trees. All embedding algorithms apply an interesting general technique based on the consecutive label property. Our algorithms produce optimal values of sum of dilations and sum of edge-congestions in linear time. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(3), 173–178 2004
منابع مشابه
The Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملEmbedding an Arbitrary Binary Tree into the Star Graph
| Binary tree structures have been very useful in solving divide-and-conquer type of problems. Embedding binary trees into another network|the host network|helps in designing solutions for the host network using the known solutions on binary trees. Embedding arbitrary binary trees into networks, in particular into the hypercube, has been addressed in the literature. The latter was achieved with...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملNetwork Design and Game Theory Spring 2008 Lecture 4 Instructor : Mohammad
In this lecture we introduce the technique of probabilistic embedding of arbitrary graphs into trees and describe some of its applications. We give various definitions, theorems and present approximation algorithms making use of probabilistic embedding. The main benefit that we get out of embedding graphs into trees is that we can then solve the given graph problem on the corresponding tree, wh...
متن کاملA New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making desirable fast simulations of binary trees on hypercubes. In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant congestion. The nov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 44 شماره
صفحات -
تاریخ انتشار 2004